Irreducible matrix representations of finite semigroups
نویسندگان
چکیده
منابع مشابه
Irreducible Matrix Representations of Finite Semigroups
Munn [9] has shown that for a semigroup S satisfying the minimal condition on principal ideals, there is a natural one-to-one correspondence between irreducible representations of S and irreducible representations vanishing at zero of its 0-simple (or simple) principal factors; for the case of S finite, see Ponizovskii [11]. On the other hand, Clifford, [3] and [4], has obtained all representat...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولComplex Representations of Matrix Semigroups
Let M be a finite monoid of Lie type (these are the finite analogues of linear algebraic monoids) with group of units G . The multiplicative semigroup ^AfF), where F is a finite field, is a particular example. Using HarishChandra's theory of cuspidal representations of finite groups of Lie type, we show that every complex representation of M is completely reducible. Using this we characterize t...
متن کاملMatrix Representations of ¿-simple Semigroups
By a 'representation' we shall mean throughout a representation by n x n matrices with entries from an arbitrary (commutative) field. Clifford has constructed all representations of completely simple semigroups [1; 4]. Munn has determined the representations of finite semigroups for which the corresponding semigroup algebra is semi-simple [6]. It is noted by Clifford and Preston [4] that if S i...
متن کاملComputing Irreducible Representations of Finite Groups
We consider the bit-complexity of the problem stated in the title. Exact computations in algebraic number fields are performed symbolically. We present a polynomial-time algorithm to find a complete set of nonequivalent irreducible representations over the field of complex numbers of a finite group given by its multiplication table. In particular, it follows that some representative of each equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1969
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1969-0242973-3